Yet More Circle Generators

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Yet More Smooth Mapping Spaces

We extend the construction of the manifold structure of smooth mapping spaces even further, and show that the mapping functor takes regular maps to regular maps.

متن کامل

Yet More Pm Survey Discoveries....?

The Parkes Multibeam (PM) survey has found nearly 50% of the >1400 known pulsars and detected 20% of the pulsars in binary systems (75% within the survey area), few of these are millisecond pulsars with orbits of less than one day. It is known that the normal search techniques used in the PM Survey have selected against finding binary pulsars, due to the long integration times used. The relativ...

متن کامل

More efficient DDH pseudorandom generators

In this paper, we first show a DDH Lemma, which states that a multi-variable version of the decisional Diffie-Hellman problem is hard under the standard DDH assumption, where the group size is not necessarily known. Our proof, based on a self-reducibility technique, has a small reduction complexity. Using DDH Lemma, we extend the FSS pseudorandom generator of Farashahi et al. to a new one. The ...

متن کامل

Yet More Projective Curves over F2

All plane curves of degree less than 7 with coefficients in F2 are examined for curves with a large number of Fq rational points on their smooth model, for q = 2,m = 3, 4, ..., 11. Known lower bounds are improved, and new curves are found meeting or close to Serre’s, Lauter’s, and Ihara’s upper bounds for the maximal number of Fq rational points on a curve of genus g.

متن کامل

More Precise Yet Widely Applicable Cost Analysis

Cost analysis aims at determining the amount of resources required to run a program in terms of its input data sizes. Automatically inferring precise bounds, while at the same time being able to handle a wide class of programs, is a main challenge in cost analysis. (1) Existing methods which rely on computer algebra systems (CAS) to solve the obtained cost recurrence equations (CR) are very pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1990

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/33.5.408